TiPeNeSS: a timed petri net simulator software with generally distributed firing delays
نویسندگان
چکیده
Performance analysis can be carried out in several ways, especially in case of Markovian models. In order to interpret high level of abstraction, we often use modeling tools like timed Petri nets (TPNs). Although some subclasses of TPNs (e.g. stochastic Petri nets (SPNs) [17, 19]) can be handled analytically, a general timed Petri net is hard to evaluate via numerical analysis. However, the simulation of SPNs or deterministic and stochastic Petri nets (DSPNs) [16] are supported by many known tools (see, e.g. [3, 20]), it is hard to find a simulation tool for timed Petri nets with generally distributed (i.e., particular but arbitrarily chosen) firing times. In this paper, we present TiPeNeSS (Timed Petri Net Simulator Software) which supports the simulation of timed Petri nets containing transitions with generally distributed firing delays. The input of the software (the Petri net and the parameters) is defined in an XML file, what allows us to generate results in batch mode. Besides, we describe a case study in which we optimize the frequency of the regular maintenance in a manufacturing process.
منابع مشابه
A characterization of the stochastic process underlying a stochastic Petri net
Stochastic Petri nets (SPNs) with generally distributed firing times can model a large class of systems, but simulation is the only feasible approach for their solution. We explore a hierarchy of SPN classes where modeling power is reduced in exchange for an increasingly efficient solution. Generalized stochastic Petri nets (GSPNs), deterministic and stochastic Petri nets (DSPNs), semi-Markovia...
متن کاملM–timed Petri Nets, Priorities, Preemptions, and Performance Evaluation of Systems
In M–timed Petri nets, firing times are exponentially distributed random variables associated with transitions of a net. Several classes of M–timed Petri nets are discussed in this paper to show increasing “modelling power” of different nets. Conflict–free nets can model M and Ek–type queueing systems. Free—choice nets can also represent Hk–type systems. Systems with several classes of users an...
متن کاملTrace Recovery: A Distributed Computing Application for Perturbation Tracking
Execution monitoring plays a central role in most software development tools for parallel and distributed computer systems. However, such monitoring may induce delays that corrupt event timing. In this paper we introduce a perturbation analysis-like algorithm that, given a safe timed Petri net model of the monitored software, can recover the uncorrupted event timings , i.e., those that would ha...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملTrace Recovery in Multi-Processing Systems: Architectural Considerations
Execution monitoring plays a central role in most software development tools for parallel and distributed computer systems. However, such monitoring may induce delays that corrupt trace event timing. If this corruption can be quantiied it may be possible to determine the intrusion-free behavior. Recently we demonstrated that, given a safe timed Petri net model of monitored software, it is possi...
متن کامل